Querying disjunctive databases through nonmonotonic logics
نویسندگان
چکیده
منابع مشابه
Querying Disjunctive Database Through Nonmonotonic Logics
Query languages for retrieving information from disjunctive databases are an interesting open area of research. In this paper we study the expressive power of major non-monotonic formalisms { such as circumscription, default logic, autoepis-temic logic and some logic programming languages { used as query languages over disjunctive databases. For this aim, we deene the semantics of query express...
متن کاملQuerying Databases from Description Logics
Two diierent aspects of data management are addressed by description logics (DL) and databases (DB): the semantic organization of data and powerful reasoning services (by DL) and their eecient management and access (by DB). It is recently emerging that experiences from both DL and DB should prootably cross-fertilize each other, and a great interest is rising about this topic. In the present pap...
متن کاملQuerying Disjunctive Databases in Polynomial Time∗
One of the major hurdles to implementing a practical disjunctive database is the CoNP-completeness of executing queries. We demonstrate, however, that this problem is similar to the problem of computing the transitive closure of a node in a disjunctive graph. While this problem is also CoNP-complete in general, we show in this paper that there is a polynomial-time solution that solves it for ce...
متن کاملOptimizing Query Answering in Description Logics using Disjunctive Deductive Databases
Motivated by the possibilities of applying deductive database technology for efficient query answering in description logics, we present a translation operator μ that transforms non-recursive ALC ontologies into a disjunctive deductive database. Contrary to our previous work, in this paper we focus on handling negation, disjunction and existential quantifiers, which cannot be handled by deducti...
متن کاملPreservationist Logics and Nonmonotonic Logics
Any number of distinct logical consequence-relations can be represented in preservationist terms—as preserving one or more properties of sets of sentences—providing a general and abstract perspective from which to consider theories of consequence. One simple way of defining such consequence-relations, however, yields ones that are always strictly monotonic. At the same time, many nonmonotonic l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00192-1